A survey of advanced ethernet forwarding approaches

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

a structural survey of the polish posters

تصویرسازی قابلیتهای فراوانی را دارا است

15 صفحه اول

Scalable, High Performance Ethernet Forwarding Lookup

This poster will describe a new Ethernet forwarding lookup architecture that enables the simple construction of switches that can contain tens of millions of forwarding entries. The core design is based upon recent work on concurrent multi-reader cuckoo hashing [1] to create fast and memory-efficient lookup tables. This work has two primary benefits: First, it suggests that were a need for such...

متن کامل

Ethernet Topology Discovery: A Survey

Ethernet networks have undergone impressive growth since the past few decades. This growth can be appreciated in terms of the equipment, such as switches and links, that have been added, as well as in the number of users that it supports. In parallel to this expansion, over the past decade the networking research community has shown a growing interest in discovering and analyzing the Ethernet t...

متن کامل

A Survey of Anomaly Detection Approaches in Internet of Things

Internet of Things is an ever-growing network of heterogeneous and constraint nodes which are connected to each other and the Internet. Security plays an important role in such networks. Experience has proved that encryption and authentication are not enough for the security of networks and an Intrusion Detection System is required to detect and to prevent attacks from malicious nodes. In this ...

متن کامل

The Forwarding Indices of Graphs -- a Survey

A routing R of a given connected graph G of order n is a collection of n(n−1) simple paths connecting every ordered pair of vertices of G. The vertexforwarding index ξ(G,R) of G with respect to R is defined as the maximum number of paths in R passing through any vertex of G. The vertex-forwarding index ξ(G) of G is defined as the minimum ξ(G,R) over all routing R’s of G. Similarly, the edge-for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Surveys & Tutorials

سال: 2009

ISSN: 1553-877X

DOI: 10.1109/surv.2009.090108